Book reviews

Third World Military Expenditure: Determinants and Implications. By Robert McKinlay. Frances Pinter, London (1989)

The UK Defence Industrial Base: Development and Future Policy Options. By Trevor Taylor and Keith Hayward. Brassey's, London, for Royal United Services Institute (1989), ISBN 0-08-036713-5, £22.50

Mutiny. By Lawrence James. Buchan & Enright, London (1987), ISBN 0-907675-70-0, £12.95; Scapegoat! Famous Courts Martial. By John Harris. Severn House, London (1988), ISBN 0-7278-2103-2, £12.95; In Glass Houses. By Robert Boyes. Military Provost Staff Corps Association, Colchester (1986), ISBN 0-9513467-0-9, £6.50 (paperback)

The Nuclear Weapons World: Who, How and Where. Edited by Patrick Burke. Frances Pinter, London (1988), ISBN 086187-705-5, £50.00

Merchants of Treason—America's Secrets for Sale. By Thomas B. Allen and Norman Polmar. Robert Hale, London (1988), ISBN 0-7090-3543-8, £14.95 ($21.95); Intelligence and Intelligence Policy in a Democratic Society. Edited by Stephen J. Cimbala. Transnational Publishers, Dobbs Ferry, NY (1987), ISBN 0-941320-44-8, $37.50; Catching Spies—Principles and Practices of Counterespionage. By H. H. A. Cooper and Lawrence J. Redlinger. Paladin Press, Boulder, CO (1988), ISBN 0-87364-466-2, $24.95

The BattleshipRoyal Sovereignand Her Sister Ships. By Peter C. Smith. William Kimber, Wellingborough (1988), ISBN 0-7183-0704-6, £12.95; Air Power at Sea, 1945 to Today. By John Winton. Sidgwick & Jackson, London (1987), £9.95     

A note on the “value” of bounds on EVPI in stochastic programming

The existing literature concentrates on determining sharp upper bounds for EVPI in stochastic programming problems. This seems to be a problem without an application. Lower bounds, which we view as having an important application, are only the incidental subject of study and in the few instances that are available are obtained at an extremely high cost. In order to suggest a rethinking of the course of this research, we analyze the need for bounds on EVPI in the context of its significance in decision problems.     

生产企业计算机管理信息系统经济效益评价方法

对生产企业ＭＩＳ经济效益的评价方法作了新的探讨,分析了ＭＩＳ获取经济效益的过程,提出了评价算法,讨论了评价中应注意的问题。文章中首次引入若干“效果系数”,从不同角度体现了ＭＩＳ运行后对经济效益的不同影响程度。     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

A platform for initial testing of multiple camouflage patterns

The human visual system is still an important factor in military warfare; military personnel receive training on effective search strategies, and camouflage that can effectively conceal objects and personnel is a key component of a successful integrated survivability strategy. Previous methods of camouflage assessment have, amongst others, used psychophysics to generate distinctiveness metrics. However, the population from which the human observers are drawn is often not well defined, or necessarily appropriate. In this experiment we designed a new platform for testing multiple patterns based on a camouflaged object detection task, and investigate whether trained military observers perform better than civilians. We use a two-alternative forced choice paradigm, with participants searching images of woodland for a replica military helmet displaying Olive Green, Multi Terrain Pattern, US Marine Pattern or, as a conspicuous control, UN Peacekeeper Blue. Our data show that there is no difference in detection performance between the two observer groups but that there are clear differences in the effectiveness of the different helmet colour patterns in a temperate woodland environment. We conclude that when tasks involve very short stimulus presentation times, task-specific training has little effect on the success of target detection and thus this paradigm is particularly suitable for robust estimates of camouflage efficacy.     

舰机时间协同对潜检查搜索样式

舰机一体化反潜是反潜作战最有效的形式,而舰机协同反潜搜索是其最重要的组成部分.从实际应用的角度出发,研究了舰机时间协同检查搜索样式,并给出了基于该样式的实际应用例子.     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Military Expenditures and Natural Resources: Evidence from Rentier States in the Middle East and North Africa

It has been argued that the discovery of a new natural resource greatly increases the risk of conflict. This research aims to study the effect of natural resources on military spending, using the data from rentier states in the Middle East and North Africa (MENA) countries from 1987 to 2012. In considering the ‘resource curse,’ the types of natural resources matter. Our empirical results demonstrate that the ‘resource curse’ arising from the abundance of certain natural resources, particularly oil and forest resources, leads to increases in military spending. In contrast, the rent from coal and natural gas has a negative impact on military spending, while the rent from minerals has no impact on military spending, controlling for GDP growth and per capita income.